Multidimensional Analogs of the Kendall Equation for Priority Queueing Systems: Computational Aspects
نویسندگان
چکیده
An analogy between celebrated Kendall equation for busy periods in the system M |GI|1 and analytical results for busy periods in the priority systemsMr|GIr |1 is drawn. These results can be viewed as generalizations of the functional Kendall equation. The methodology and algorithms of numerical solution of recurrent functional equations which appear in the analysis of such queueing systems are developed. The efficiency of the algorithms is achieved by acceleration of the numerical procedure of solving the classical Kendall equation. An algorithm of calculation of the system workload coefficient calculation is given. PACS number: 02.50.Fz DOI: 10.1134/S0005117908060088
منابع مشابه
Numerical treatment of the Kendall equation in the analysis of priority queueing systems
We investigate here how to treat numerically the Kendall functional equation occuring in the theory of branching processes and queueing theory. We discuss this question in the context of priority queueing systems with switchover times. In numerical analysis of such systems one deals with functional equations of the Kendall type and efficient numerical treatment of these is necessary in order to...
متن کاملOn Multidimensional Analog of Kendall-Takacs Equation and its Numerical Solution
A class of priority queueing systems with non-zero switching times, referred to as generalized priority systems, is considered and discussed. Analytical results regarding the distribution of busy periods and various auxiliary characteristics are presented. The algorithms of the numerical solution of recurrent functional equations which appear in the analysis of the characteristics of such syste...
متن کاملOn fluid queueing systems with strict priority
We consider priority fluid queueing systems where high priority class has strict priority access to service. Sample path analysis tools, such as Poisson Counter Driven Stochastic Differential Equation, are employed to study system queueing behavior in steady state. We are able to obtain various analytical results for different fluid traffic models and system configurations. Those results can be...
متن کاملEmergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کامل